Managing data transfer in a network environment

ABSTRACT

A method for managing data transfer in a network environment, the method is provided. The method comprises receiving a request to transfer first data from a first source in a source domain comprising a plurality of sources to a first target in a target domain comprising a plurality of targets. If the first source is configured to transfer data in a first mode or if the first source is configured to transfer data in a second mode and the first data has previously been transferred to the target domain, a signature of the first data is transferred to the first target instead of the first data. If the first source is configured to operate in the second mode and the first data has not previously been transferred to the target domain, the first data is transferred to the first target.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of and claims priority to thefiling date of U.S. patent application Ser. No. 12/636,744, filed on2009 Dec. 13 and issued as U.S. Pat. No. 8,213,331 on, Jul. 3, 2012 thecontent of which is incorporated herein by reference in its entirety.

COPYRIGHT & TRADEMARK NOTICES

A portion of the disclosure of this patent document contains material,which is subject to copyright protection. The owner has no objection tothe facsimile reproduction by any one of the patent document or thepatent disclosure, as it appears in the Patent and Trademark Officepatent file or records, but otherwise reserves all copyrightswhatsoever.

Certain marks referenced herein may be common law or registeredtrademarks of third parties affiliated or unaffiliated with theapplicant or the assignee. Use of these marks is for providing anenabling disclosure by way of example and shall not be construed tolimit the scope of the claimed subject matter to material associatedwith such marks.

TECHNICAL FIELD

The disclosed subject matter relates generally to managing data transferin a network environment and, more particularly, to managing datatransfer between multiple sources and multiple targets in a networkenvironment.

BACKGROUND

In a network environment, a first computing system may request data froma source computing system, and the source computing system may transferthe data to the first computing system to service the request. If asecond computing system, in a peer-to-peer data transfer relationshipwith the first computing system, requests the same data from the sourcecomputing system, the first computing system may be used to transfer allor part of the data to the second target computing system, instead or inconjunction with the source computing system.

Existing implementations for managing transfer of data in a peer-to-peernetwork environment generally support transfer of static data (i.e.,data that does not require frequent updates). Such implementations failto support collaboration between the computing systems to enhance orimprove the efficiency of the data transfer process.

SUMMARY

For purposes of summarizing, certain aspects, advantages, and novelfeatures have been described herein. It is to be understood that not allsuch advantages may be achieved in accordance with any one particularembodiment. Thus, the disclosed subject matter may be embodied orcarried out in a manner that achieves or optimizes one advantage orgroup of advantages without achieving all advantages as may be taught orsuggested herein.

For purposes of summarizing, certain aspects, advantages, and novelfeatures have been described herein. It is to be understood that not allsuch advantages may be achieved in accordance with any one particularembodiment. Thus, the claimed subject matter may be embodied or carriedout in a manner that achieves or optimizes one advantage or group ofadvantages without achieving all advantages as may be taught orsuggested herein.

In accordance with one embodiment, a method for managing data transferin a network environment, the method is provided. The method comprisesreceiving a request to transfer first data from a first source in asource domain comprising a plurality of sources to a first target in atarget domain comprising a plurality of targets. If the first source isconfigured to transfer data in a first mode or if the first source isconfigured to transfer data in a second mode and the first data haspreviously been transferred to the target domain, a signature of thefirst data is transferred to the first target instead of the first data.If the first source is configured to operate in the second mode and thefirst data has not previously been transferred to the target domain, thefirst data is transferred to the first target.

In accordance with another embodiment, a system comprising one or morelogic units is provided. The one or more logic units are configured toperform the functions and operations associated with the above-disclosedmethods. In accordance with yet another embodiment, a computer programproduct comprising a computer useable medium having a computer readableprogram is provided. The computer readable program when executed on acomputer causes the computer to perform the functions and operationsassociated with the above-disclosed methods.

One or more of the above-disclosed embodiments in addition to certainalternatives are provided in further detail below with reference to theattached figures. The disclosed subject matter is not, however, limitedto any particular embodiment disclosed.

BRIEF DESCRIPTION OF THE DRAWINGS

The disclosed embodiments may be better understood by referring to thefigures in the attached drawings, as provided below.

FIG. 1 illustrates an exemplary network environment, in accordance withone or more embodiments.

FIG. 2 is a flow diagram of a method for transferring a data chunk to atarget, in accordance with one embodiment.

FIG. 3 is a flow diagram of a method for processing a signature receivedfrom a source, in accordance with one embodiment.

FIG. 4 illustrates additional components of a source domain, inaccordance with one embodiment.

FIG. 5 illustrates additional components of a target domain, inaccordance with one embodiment.

FIG. 6 is a flow diagram of a method for transferring a data chunk to atarget in an optimistic mode, in accordance with one embodiment.

FIG. 7A through 7C is a flow diagram of a method for transferring a datachunk to a target in a pessimistic mode, in accordance with oneembodiment.

FIG. 8 is a flow diagram of a method for processing a data chunkreceived from a source, in accordance with one embodiment.

FIGS. 9A through 9C are flow diagrams of a method for processing asignature received from a source, in accordance with one embodiment.

FIGS. 10 and 11 are block diagrams of hardware and software environmentsin which a system of the present invention may operate, in accordancewith one or more embodiments.

Features, elements, and aspects that are referenced by the same numeralsin different figures represent the same, equivalent, or similarfeatures, elements, or aspects, in accordance with one or moreembodiments.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

In the following, numerous specific details are set forth to provide athorough description of various embodiments of the claimed subjectmatter. Certain embodiments may be practiced without these specificdetails or with some variations in detail. In some instances, certainfeatures are described in less detail so as not to obscure other aspectsof the disclosed embodiments. The level of detail associated with eachof the elements or features should not be construed to qualify thenovelty or importance of one feature over the others.

Referring to FIG. 1, in accordance with one or more embodiments, anexemplary network environment 100 comprises a source domain 110including one or more source nodes 112, 114, 116 and a target domain 120including one or more target nodes 122, 124, 126, 128. The source nodesmay transfer data to the target nodes over a network 130. In oneembodiment, network 130 may comprise a peer-to-peer network in which atarget node may act as a source node and may thus transfer data toanother node in the network 130. It is noteworthy that the datatransferred between nodes in the network environment 100 may comprisestatic data (i.e., infrequently updated data), non-static data (i.e.,frequently updated data), or a combination thereof.

Data transfer operations among the nodes in network 130 may be dependenton a designated data transfer mode. The data transfer mode may be set ordetermined based on source side cloud topologies or costs, status ofsources or targets, or other dynamically changing factors. For example,a first mode (e.g., a pessimistic mode) may be desirable for a primarysource with decreased transfer costs, and a second mode (e.g., anoptimistic mode) may be desirable for a secondary source with limitednetwork bandwidth. The optimistic mode may also be desirable for a new,migrating, or reviving source that is not synchronized with a targetthat has previously received most of the data chunks to be transferredby the source.

In a pessimistic mode, data is directly transferred from a designatedsource (e.g., the original source of the data) to a destination target.In contrast, in an optimistic mode, the data transfer to a target nodemay be from a peer node instead of the original source of the data andinvolve the transfer of a signature of the data rather than the actualdata itself. A signature refers to a value that may be utilized touniquely identify a data chunk such that identical copies of the datachunk have the same value. For example, in one implementation, asignature of a data chunk may be a hash value generated from the datachunk during a de-duplication process.

Referring to FIGS. 1 and 2, in accordance with one embodiment, thesource domain 110 may receive a request to transfer data (e.g., a firstdata chunk) to target 122 (P200). In response to the request, the sourcedomain 110 calculates a signature of the first data chunk and determinesthe mode in which data transfer is to be performed (P210, P220). Ifsource 112 receives the request while in an optimistic mode, the sourcedomain 110 (e.g., source 112, 114, or 116) transfers the signature ofthe first data chunk to target 122 instead of the first data chunk(P230).

If source 112 receives the request while in a pessimistic mode, thesource domain 110 determines whether the source domain 110 haspreviously transferred the first data chunk to the target domain 120(P240). That is, the source domain 110 determines whether any source(e.g., source 112, 114, or 116) has previously transferred the firstdata chunk to any target (e.g., targets 122, 124, 126, 128). If thesource domain 110 has previously transferred the first data chunk to thetarget domain 120, the source domain (e.g., source 112, 114, or 116)transfers the signature of the first data chunk to target 122 instead ofthe first data chunk (P230).

Otherwise, source 112 transfers the first data chunk to target 122(P250). In one implementation, a repository shared by sources 112, 114,and 116 may be utilized to determine whether any source has previouslytransferred a data chunk to any target. The shared repository maymaintain a history of data chunks transferred to the target domain 120,as provided in further detail below.

Referring to FIGS. 1 and 3, in accordance with one embodiment, target122 may receive a signature of a first data chunk instead of the firstdata chunk (P300). Upon receiving the signature, target 122 utilizes thesignature to determine whether the first data chunk is available in thetarget domain 120 (e.g., available at targets 124, 126, or 128) (P310).In one implementation, a repository shared by targets 122, 124, 126, and128 may be utilized to determine whether a data chunk is available inthe target domain 120. The shared repository may maintain a history ofdata chunks received by the target domain 120, as provided in furtherdetail below.

If the first data chunk is available in the target domain 120, target122 retrieves the first data chunk from the target domain 120 (e.g.,targets 124, 126, or 128) (P320). It is noteworthy that if the firstdata chunk has previously been transferred to the target domain 120 buthas subsequently been modified, the signature of the first data chunkreceived by target 122 will not match the signature of the first datachunk, as modified. In such a scenario, it will be determined that thefirst data chunk is not available in the target domain 120, and thesource domain 110 will be requested to forward the first data chunkagain to the target domain 120.

Referring to FIG. 4, in accordance with one embodiment, sources 112,114, 116 may execute respective source managers 400 to manage datarequests received from targets 122, 124, 126, 128. The source managers400 may be part of a distributed software for managing data requestsreceived by the source domain 110. The source domain 110 may furthercomprise a mode manager 410, a source signature repository 420, a sourcedata repository 430, and a source data cleaner 440. Access to the sourcesignature repository 420 and the source data repository 540 may beshared by the source managers 400. The mode manager 410 may configuresources 112, 114, 116 to transfer data in the optimistic mode or thepessimistic mode according to one or more factors, as provided earlier.

The source signature repository 420 may be a centralized or distributedrepository that manages records of signatures transferred to the targetdomain 120 with their respective data chunks. In one implementation, arecord in the source signature repository 420 may comprise a signatureof a data chunk and one or more relevant tags. As used herein, relevanttags may include identifier for one or more sources that transferred thedata chunk to the target domain 120, identifiers for one or more targetsto which the sources transferred the data chunk, data dependencyinformation related to the data chunk (e.g., usage patterns with respectto other data chunks), the time at which the record was created, and thetime at which the record was last accessed.

The source signature repository 420 may create a record of a signatureof a data chunk when the data chunk is transferred to the target domain120 for the first time. The record may be updated when the data chunk issubsequently transferred to the target domain 120. For example, thesource signature repository 420 may include another source identifierand another target identifier in the tags. Or, the source signaturerepository 420 may modify the last access time and, if necessary, thedata dependency information in the tags.

The source data repository 430 may be a centralized or distributedrepository that manages records of data chunks for which a signature istransferred to the target domain 120 instead of a data chunk. In oneimplementation, a record in the source data repository 430 may comprisea global logical time of the data chunk, a signature of a data chunk,the data chunk, and one or more relevant tags. The global logical timemay indicate when the data chunk was transferred to the target domain120 with respect to other data chunks transferred to the target domain120.

The source data repository 430 may create a record of a data chunk whena signature of a data chunk is transferred to the target domain 120without the data chunk for the first time. The record may be updatedwhen the signature is subsequently transferred to the target domain 120instead the data chunk. For example, the source data repository 430 mayreplace an existing global logical time of the data chunk with thelatest global logical time of the data chunk. The source data repository430 may include another source identifier and another target identifierin the tags. Or, the source data repository 430 may modify the lastaccess time and, if necessary, the data dependency information in thetags.

The source data cleaner 440 may manage deletion of records from thesource data repository 420. In one implementation, the source datacleaner 440 may avoid deleting a record of a data chunk based on whetherthe record has been recently accessed, whether the record has beenfrequently accessed, cost to re-create the record, usage pattern of thedata chunk, activity level of sources identified in the data chunk,activity level of targets identified in the data chunk, or otherfactors. For example, the source data cleaner 440 may delete a record ofa data chunk if the data chunk is stable and retain the record if thedata chunk is non-stable. A data chunk is stable if the data chunk willnot be requested by the target domain 120 in the future. A data chunk isnon-stable if the data chunk may be requested by the target domain 120in the future.

Referring to FIG. 5, in accordance with one embodiment, targets 122,124, 126, 128 may execute respective target managers 500 to request andreceive data from sources 112, 114, 116. The target domain 120 mayfurther comprise a target data repository 510, a data availabilitymanager 520, and a target data cleaner 530. Access to the target datarepository 510 and the data availability manager 520 may be shared bythe targets managers 500.

The target data repository 510 may be a centralized or distributedrepository that manages records of data chunks received by the targetdomain 120. In one implementation, a record in the target datarepository 510 may comprise a signature of a data chunk received by thetarget domain 120, the data chunk, and one or more relevant tags. Inanother implementation, a record in the target data repository 510 mayfurther comprise a global logical time of the data chunk.

The target data repository 510 may create a record of a data chunk whenthe data chunk is received by the target domain 120 for the first time.The record may be updated when the target data repository 510 providesthe data chunk to a target. For example, the target data repository 510may add another target identifier. Or, the target data repository 510may modify the last access time and, if necessary, the data dependencyinformation.

The data availability manager 520 may be a shared application thatmanages availability of data chunks stored in the source domain 110 andthe target domain 120. The data availability manager 520 may retrieve adata chunk from a record of the data chunk in the target data repository510, in response to receiving a request for the data chunk from atarget. If the record does not exist in the target data repository 510,the data availability manager 520 may retrieve the record from thesource data repository 430. The data availability manager 520 may alsomaintain an internal global logical time that indicates when the latestdata chunk was received from the source data repository 430.

The target data cleaner 530 may manage deletion of records from thetarget data repository 510 according to a certain policy. In oneimplementation, the target data cleaner 530 may avoid deleting a recordof a data chunk based on whether the record has been recently accessed,whether the record has been frequently accessed, cost to re-create therecord, usage pattern of the data chunk, activity level of sourcesidentified in the data chunk, activity level of targets identified inthe data chunk, or other factors.

In one implementation, synchronization between the source domain 110 andthe target domain 120 may be performed according to a loosesynchronization protocol such as an enhanced wide area network (WAN)de-duplication protocol. In such an implementation, the dataavailability manager 520 may periodically submit a synchronizationprotocol message with the internal global logical time to the sourcedomain 110. The source data cleaner 440 and the target cleaner 630 mayutilize the internal global logical time to delete stable records (i.e.,records including a global logical time less than the internal globallogical time) from the source data repository 430 and the target datarepository 510, respectively.

Referring to FIGS. 4 through 6, in accordance with one embodiment, themode manager 410 may configure a source manager 400 to operate in anoptimistic mode (P600). In response to receiving a request to transferdata (e.g., a first data chunk) to a target manager 500, the sourcemanager 400 calculates a signature of the first data chunk and transfersthe signature to the target manager 500 instead of the first data chunk(P610-P630). Upon transferring the signature to the target manager 500,the source manager 400 provides the signature, the first data chunk, andone or more relevant tags to the source data repository 430) (P640).

The source data repository 430 utilizes the signature to determinewhether a record of the first data chunk exists in the source datarepository 430 (i.e., whether the signature has previously beentransferred to the target domain 120 instead of the first data chunk)(P650). If a record of the first data chunk exists in the source datarepository 430, the source data repository 430 updates the record (e.g.,by replacing the existing global logical time with the latest globallogical time) (P660). Otherwise, the source data repository 430 utilizesthe signature, the first data chunk, and the tags to create a record ofthe first data chunk (P670).

Referring to FIGS. 4, 5, and 7A through 7C, in accordance with oneembodiment, the mode manager 410 may configure a source manager 400 tooperate in a pessimistic mode (P600). In response to receiving a requestto transfer data (e.g., a first data chunk) to a target manager 500, thesource manager 400 calculates a signature of the first data chunk andprovides the signature, a source identifier, and a target identifier tothe source signature repository 420 (P705-P715).

The source signature repository 420 utilizes the signature to determinewhether a record of the signature exists in the source signaturerepository 420 (i.e., whether the first data chunk has previously beentransferred to the target domain 120) (P720). If a record of thesignature exists in the source signature repository 420, the sourcesignature repository 420 utilizes the source identifier and the targetidentifier to update the record (e.g., by including the sourceidentifier and the target identifier in the tags) and notifies thesource manager 400 that the record exists in the source signaturerepository 420 (P725, P730). The source manager 400 transfers thesignature to the target manager 500 instead of the first data chunk(P735).

Upon transferring the signature to the target manager 500, the sourcemanager 400 provides the record of the signature and the first datachunk to the source data repository 430 (P740). The source datarepository 430 utilizes the signature included in the record todetermine whether a record of the first data chunk exists in the sourcedata repository 430 (i.e., whether the signature has previously beentransferred to the target domain 120 instead of the first data chunk)(P740). If a record of the first data chunk exists in the source datarepository 430, the source data repository 430 updates the record (e.g.,by replacing the existing global logical time with the latest globallogical time) (P750). Otherwise, the source data repository 430 utilizesthe record of the signature and the first data chunk to create a recordof the first data chunk (P755).

If a record of the signature does not exist in the source signaturerepository 420, the source signature repository 420 notifies the sourcemanager 400 that a record of the signature does not exist in the sourcesignature repository 420 (P760). The source manager 400 transfers thefirst data chunk to the target manager 500 (P765). Upon transferring thefirst data chunk to the target manager 500, the source provides thesignature, the source identifier, and the target identifier to thesource signature repository 420 (P770). The source signature repository420 utilizes the signature, the source identifier, and the targetidentifier to create a record of the signature (P775).

Referring to FIGS. 4, 5, and 8, in accordance with one embodiment, atarget manager 500 may receive the first data chunk from a sourcemanager 400 (P800). In response to receiving the first data chunk fromthe source manager 400, the target manager 500 calculates a signature ofthe data chunk and provides the signature, the first data chunk, asource identifier, and a target identifier to the target data repository510 (P810). The target data repository 510 utilizes the signature, thefirst data chunk, the source identifier, and the target identifier tocreate a record of the first data chunk (P820).

Referring to FIGS. 4, 5, and 9A through 9C, in accordance with oneembodiment, a target manager 500 may receive a signature of a first datachunk from a source manager 400 instead of the first data chunk (P900).In response to receiving the signature from the source manager 400, thetarget manager 500 provides the signature, a source identifier, and atarget identifier to the data availability manager 520 (P905). The dataavailability manager 520 utilizes the signature to determine whether arecord of the first data chunk exists in the target data repository 510(i.e., whether the first data chunk is available in the target domain120) (P910).

If a record of the first data chunk exists in the target data repository510, the target data repository 510 notifies the data availabilitymanager 520 that the record exists in the target data repository 510(P915). The data availability manager 520 notifies the target manager500 that the first data chunk is available in the target domain 120(P920). The target manager 500 utilizes the signature, the sourceidentifier, and the target identifier to request the first data chunkfrom the target data repository 510 (P925). The target data repository510 updates the record of the first data chunk and provides the firstdata chunk included in the record to the target manager 500 (P930,P935).

If a record of the first data chunk does not exist in the target datarepository 510, the target data repository 510 notifies the dataavailability manager 520 that a record of the first data chunk does notexist in the target data repository 510 (P940). The data availabilitymanager 520 utilizes the signature to request a record of the first datachunk from the source data repository 430 (P945). The source datarepository 430 provides the record to the data availability manager 520(P950).

The data availability manager 520 provides the record of the first datachunk to the target data repository 510, updates the internal globallogical time, and notifies the target manager 500 that the first datachunk is available in the target domain 120 (P955-P965). The targetmanager 500 provides the signature, the source identifier, and thetarget identifier to the target data repository 510 (P970). The targetdata repository 510 utilizes the signature, the source identifier, andthe target identifier to update the record of the first data chunk andprovide the first data chunk included in the record to the targetmanager 500 (P975, P980).

In an alternative embodiment, the source domain 110 and the targetdomain 120 may be the same domain. That is, the nodes in the sourcedomain 110 and the target domain 120 may serve as both sources andtargets. In such an embodiment, one or more components in the sourcedomain 110 and the target domain 120 may be integrated to save space ormake better decisions (e.g., select better sources for transferring datato a target). In one implementation, for example, the source datarepository 430 may be integrated with the target data repository 510.

The systems and methods provided above may support improved datatransfer with respect to cost and latency, dynamically changing sourcesand targets (e.g., changes in membership and connectivity), flexibilityin selecting sources and targets (e.g., data may be transferred from amain source instead of a branch source), and scalability with increasednumbers of sources and targets without bottlenecks in performance.Additionally, the collaboration between sources, collaboration betweentargets, and collaboration between sources and targets described abovemay allow reduction of actual transfer size of data (i.e., what tosend), negotiation of data transfer sources (i.e., where to send from),negotiation of data transfer targets (i.e., where to send to),negotiation of time of transfer (i.e., when to send), and negotiation ofdata transfer protocol (i.e., how to send).

In different embodiments, the disclosed subject matter may beimplemented as a combination of both hardware and software elements, oralternatively either entirely in the form of hardware or entirely in theform of software. Further, computing systems and program softwaredisclosed herein may comprise a controlled computing environment thatmay be presented in terms of hardware components or logic code executedto perform methods and processes that achieve the results contemplatedherein. Said methods and processes, when performed by a general purposecomputing system or machine, convert the general purpose machine to aspecific purpose machine.

Referring to FIGS. 10 and 11, a computing system environment inaccordance with an exemplary embodiment may be composed of a hardwareenvironment 1110 and a software environment 1120. The hardwareenvironment 1110 may comprise logic units, circuits or other machineryand equipments that provide an execution environment for the componentsof software environment 1120. In turn, the software environment 1120 mayprovide the execution instructions, including the underlying operationalsettings and configurations, for the various components of hardwareenvironment 1110.

Referring to FIG. 10, the application software and logic code disclosedherein may be implemented in the form of computer readable code executedover one or more computing systems represented by the exemplary hardwareenvironment 1110. As illustrated, hardware environment 110 may comprisea processor 1101 coupled to one or more storage elements by way of asystem bus 1100. The storage elements, for example, may comprise localmemory 1102, storage media 1106, cache memory 1104 or othercomputer-usable or computer readable media. Within the context of thisdisclosure, a computer usable or computer readable storage medium mayinclude any recordable article that may be utilized to contain, store,communicate, propagate or transport program code.

A computer readable storage medium may be an electronic, magnetic,optical, electromagnetic, infrared, or semiconductor medium, system,apparatus or device. The computer readable storage medium may also beimplemented in a propagation medium, without limitation, to the extentthat such implementation is deemed statutory subject matter. Examples ofa computer readable storage medium may include a semiconductor orsolid-state memory, magnetic tape, a removable computer diskette, arandom access memory (RAM), a read-only memory (ROM), a rigid magneticdisk, an optical disk, or a carrier wave, where appropriate. Currentexamples of optical disks include compact disk, read only memory(CD-ROM), compact disk read/write (CD-R/W), digital video disk (DVD),high definition video disk (HD-DVD) or Blue-ray™ disk.

In one embodiment, processor 1101 loads executable code from storagemedia 1106 to local memory 1102. Cache memory 1104 optimizes processingtime by providing temporary storage that helps reduce the number oftimes code is loaded for execution. One or more user interface devices1105 (e.g., keyboard, pointing device, etc.) and a display screen 1107may be coupled to the other elements in the hardware environment 1110either directly or through an intervening I/O controller 1103, forexample. A communication interface unit 1108, such as a network adapter,may be provided to enable the hardware environment 1110 to communicatewith local or remotely located computing systems, printers and storagedevices via intervening private or public networks (e.g., the Internet).Wired or wireless modems and Ethernet cards are a few of the exemplarytypes of network adapters.

It is noteworthy that hardware environment 1110, in certainimplementations, may not include some or all the above components, ormay comprise additional components to provide supplemental functionalityor utility. Depending on the contemplated use and configuration,hardware environment 1110 may be a desktop or a laptop computer, orother computing device optionally embodied in an embedded system such asa set-top box, a personal digital assistant (PDA), a personal mediaplayer, a mobile communication unit (e.g., a wireless phone), or othersimilar hardware platforms that have information processing or datastorage capabilities.

In some embodiments, communication interface 1108 acts as a datacommunication port to provide means of communication with one or morecomputing systems by sending and receiving digital, electrical,electromagnetic or optical signals that carry analog or digital datastreams representing various types of information, including programcode. The communication may be established by way of a local or a remotenetwork, or alternatively by way of transmission over the air or othermedium, including without limitation propagation over a carrier wave.

As provided here, the disclosed software elements that are executed onthe illustrated hardware elements are defined according to logical orfunctional relationships that are exemplary in nature. It should benoted, however, that the respective methods that are implemented by wayof said exemplary software elements may be also encoded in said hardwareelements by way of configured and programmed processors, applicationspecific integrated circuits (ASICs), field programmable gate arrays(FPGAs) and digital signal processors (DSPs), for example.

Referring to FIG. 11, software environment 1120 may be generally dividedinto two classes comprising system software 1121 and applicationsoftware 1122 as executed on one or more hardware environments 1110. Inone embodiment, the methods and processes disclosed here may beimplemented as system software 1121, application software 1122, or acombination thereof. System software 1121 may comprise control programs,such as an operating system (OS) or an information management system,that instruct one or more processors 1101 (e.g., microcontrollers) inthe hardware environment 1110 on how to function and processinformation. Application software 1122 may comprise but is not limitedto program code, data structures, firmware, resident software, microcodeor any other form of information or routine that may be read, analyzedor executed by a processor 1101.

In other words, application software 1122 may be implemented as programcode embedded in a computer program product in form of a computer-usableor computer readable storage medium that provides program code for useby, or in connection with, a computer or any instruction executionsystem. Moreover, application software 1122 may comprise one or morecomputer programs that are executed on top of system software 1121 afterbeing loaded from storage media 1106 into local memory 1102. In aclient-server architecture, application software 1122 may compriseclient software and server software. For example, in one embodiment,client software may be executed on a client computing system that isdistinct and separable from a server computing system on which serversoftware is executed.

Software environment 1120 may also comprise browser software 1126 foraccessing data available over local or remote computing networks.Further, software environment 1120 may comprise a user interface 1124(e.g., a graphical user interface (GUI)) for receiving user commands anddata. It is worthy to repeat that the hardware and softwarearchitectures and environments described above are for purposes ofexample. As such, one or more embodiments may be implemented over anytype of system architecture, functional or logical platform orprocessing environment.

It should also be understood that the logic code, programs, modules,processes, methods and the order in which the respective processes ofeach method are performed are purely exemplary. Depending onimplementation, the processes or any underlying sub-processes andmethods may be performed in any order or concurrently, unless indicatedotherwise in the present disclosure. Further, unless stated otherwisewith specificity, the definition of logic code within the context ofthis disclosure is not related or limited to any particular programminglanguage, and may comprise one or more modules that may be executed onone or more processors in distributed, non-distributed, single ormultiprocessing environments.

As will be appreciated by one skilled in the art, a software embodimentmay include firmware, resident software, micro-code, etc. Certaincomponents including software or hardware or combining software andhardware aspects may generally be referred to herein as a “circuit,”“module” or “system.” Furthermore, the subject matter disclosed may beimplemented as a computer program product embodied in one or morecomputer readable storage medium(s) having computer readable programcode embodied thereon. Any combination of one or more computer readablestorage medium(s) may be utilized. The computer readable storage mediummay be a computer readable signal medium or a computer readable storagemedium. A computer readable storage medium may be, for example, but notlimited to, an electronic, magnetic, optical, electromagnetic, infrared,or semiconductor system, apparatus, or device, or any suitablecombination of the foregoing.

In the context of this document, a computer readable storage medium maybe any tangible medium that can contain, or store a program for use byor in connection with an instruction execution system, apparatus, ordevice. A computer readable signal medium may include a propagated datasignal with computer readable program code embodied therein, forexample, in baseband or as part of a carrier wave. Such a propagatedsignal may take any of a variety of forms, including, but not limitedto, electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable storagemedium that is not a computer readable storage medium and that cancommunicate, propagate, or transport a program for use by or inconnection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable storage medium may betransmitted using any appropriate medium, including but not limited towireless, wireline, optical fiber cable, RF, etc., or any suitablecombination of the foregoing. Computer program code for carrying out thedisclosed operations may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages.

The program code may execute entirely on the user's computer, partly onthe user's computer, as a stand-alone software package, partly on theuser's computer and partly on a remote computer or entirely on theremote computer or server. In the latter scenario, the remote computermay be connected to the user's computer through any type of network,including a local area network (LAN) or a wide area network (WAN), orthe connection may be made to an external computer (for example, throughthe Internet using an Internet Service Provider).

Certain embodiments are disclosed with reference to flowchartillustrations and/or block diagrams of methods, apparatus (systems) andcomputer program products according to embodiments. It will beunderstood that each block of the flowchart illustrations and/or blockdiagrams, and combinations of blocks in the flowchart illustrationsand/or block diagrams, can be implemented by computer programinstructions. These computer program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

These computer program instructions may also be stored in a computerreadable storage medium that can direct a computer, other programmabledata processing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablestorage medium produce an article of manufacture including instructionswhich implement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments. In this regard, each block in the flowchart or blockdiagrams may represent a module, segment, or portion of code, whichcomprises one or more executable instructions for implementing thespecified logical function(s). It should also be noted that, in somealternative implementations, the functions noted in the block may occurout of the order noted in the figures.

For example, two blocks shown in succession may, in fact, be executedsubstantially concurrently, or the blocks may sometimes be executed inthe reverse order, depending upon the functionality involved. It willalso be noted that each block of the block diagrams and/or flowchartillustration, and combinations of blocks in the block diagrams and/orflowchart illustration, can be implemented by special purposehardware-based systems that perform the specified functions or acts, orcombinations of special purpose hardware and computer instructions.

The disclosed subject matter has been provided here with reference toone or more features or embodiments. Those skilled in the art willrecognize and appreciate that, despite of the detailed nature of theexemplary embodiments provided here, changes and modifications may beapplied to said embodiments without limiting or departing from thegenerally intended scope. These and various other adaptations andcombinations of the embodiments provided here are within the scope ofthe disclosed subject matter as defined by the claims and their full setof equivalents.

What is claimed is:
 1. A computer-implemented method for managing datatransfer in a communications network environment, the method comprising:receiving, over the communications network, a request to transfer firstdata from a first source in a source domain comprising a plurality ofsources to a first target in a target domain comprising a plurality oftargets; transferring a signature of the first data to the first target,in response to determining that the first source is configured totransfer data in a first mode; and transferring the first data to thefirst target instead of the signature of the first data, in response todetermining that the first source is configured to operate in the secondmode.
 2. The method of claim 1 wherein the first data is transferred tothe first target instead of the signature of the first data, if thefirst data has not previously been transferred to the target domain. 3.The method of claim 1 further comprising transferring the signature ofthe first data to the first target instead of the first data, inresponse to determining that the first source is configured to transferdata in a second mode and the first data has previously been transferredto the target domain.
 4. The method of claim 1, wherein the first targetutilizes the signature of the first data to determine whether the firstdata is available in the target domain, in response to receiving thesignature of the first data from the first source.
 5. The method ofclaim 4, wherein the first target retrieves the first data from thetarget domain, in response to receiving the signature of the first dataand determining that the first data is available in the target domain.6. The method of claim 5, wherein the first target retrieves the firstdata from the source domain, in response to receiving the signature ofthe first data and determining that the first data is not available inthe target domain.
 7. The method of claim 6, wherein the plurality ofsources included in the source domain share access to a first repositoryutilized to determine whether the first data has previously beentransferred to the target domain.
 8. The method of claim 7, wherein theplurality of sources included in the source domain share access to asecond repository utilized to determine whether the signature haspreviously been transferred to the target domain instead of the firstdata.
 9. The method of claim 8, wherein the plurality of targetsincluded in the target domain share access to a third repositoryutilized to determine whether the first data is available in the targetdomain.
 10. The method of claim 9, wherein the source domain and thetarget domain are a same domain such that a same group of nodes serve asboth the plurality of sources and the plurality of targets, wherein thesecond and third repositories are integrated into a single repository,and wherein synchronization between the source domain and the targetdomain is performed according to a wide area network (WAN)de-duplication protocol.
 11. A computer-implemented system for managingdata transfer in a communications network environment, the systemcomprising: a logic unit for receiving, over the communications network,a request to transfer first data from a first source in a source domaincomprising a plurality of sources to a first target in a target domaincomprising a plurality of targets; a logic unit for transferring asignature of the first data to the first target, in response todetermining that the first source is configured to transfer data in afirst mode; and a logic unit for transferring the first data to thefirst target instead of the signature of the first data, in response todetermining that the first source is configured to operate in the secondmode.
 12. The system of claim 11 wherein the first data is transferredto the first target instead of the signature of the first data, if thefirst data has not previously been transferred to the target domain. 13.The system of claim 11 further comprising transferring the signature ofthe first data to the first target instead of the first data, inresponse to determining that the first source is configured to transferdata in a second mode and the first data has previously been transferredto the target domain.
 14. The system of claim 11, wherein the firsttarget utilizes the signature of the first data to determine whether thefirst data is available in the target domain, in response to receivingthe signature of the first data from the first source.
 15. The system ofclaim 14, wherein the first target retrieves the first data from thetarget domain, in response to receiving the signature of the first dataand determining that the first data is available in the target domain.16. A computer program product comprising a computer readable storagemedium having a non-transitory computer readable program, wherein thecomputer readable program when executed on a computer causes thecomputer to: receive a request to transfer first data from a firstsource in a source domain comprising a plurality of sources to a firsttarget in a target domain comprising a plurality of targets; transfer asignature of the first data to the first target, in response todetermining that the first source is configured to transfer data in afirst mode; and transfer the first data to the first target instead ofthe signature of the first data, in response to determining that thefirst source is configured to operate in the second mode.
 17. Thecomputer program product of claim 16, wherein the first data istransferred to the first target instead of the signature of the firstdata, if the first data has not previously been transferred to thetarget domain.
 18. The computer program product of claim 16, wherein thesignature of the first data is transferred to the first target insteadof the first data, in response to determining that the first source isconfigured to transfer data in a second mode and the first data haspreviously been transferred to the target domain.
 19. The computerprogram product of claim 16, wherein the first target utilizes thesignature of the first data to determine whether the first data isavailable in the target domain, in response to receiving the signatureof the first data from the first source.
 20. The computer programproduct of claim 19, wherein the first target retrieves the first datafrom the target domain, in response to receiving the signature of thefirst data and determining that the first data is available in thetarget domain.